Limitation of Efficiency: Strategy-Proofness and Single-Peaked Preferences with Many Commodities

نویسنده

  • Hiroo Sasaki
چکیده

In this paper, we study a resource allocation problem of economies with many commodities and single-peaked preferences. It is known that the uniform rule is the unique allocation mechanism satisfying strategy-proofness, Pareto efficiency and anonymity, if the number of good is only one and pereferences are single-peaked. (Sprumont [7].) However, if the number of goods is greater than one, the situation drastically changes and a tradeoff between efficiency and strategy-proofness arises. The generalized uniform rule in multiple-commodity settings is still starategy-proof, but not Pareto efficient in general. In this paper, we show that in a class of all strategy-proof mechanisms the generalized uniform rule is a ”second best” strategy-proof mechanism in that there is no other strategy-proof mechanism which gives a ”better” outcome than the generalized uniform rule in terms of Pareto domination.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Second-best Efficiency of Allocation Rules: Strategy-proofness and Single-peaked Preferences with Multiple Commodities∗

This paper studies the design of a strategy-proof resource allocation rule in economies with perfectly divisible multiple commodities and single-peaked preferences. It is known that the uniform rule is the unique allocation rule satisfying strategy-proofness, Pareto efficiency, and anonymity if the number of commodity is only one and preferences are single-peaked (Sprumont (1991)). However, if ...

متن کامل

A Maximal Domain of Preferences for Tops-only Rules in the Division

The division problem consists of allocating an amount M of a perfectly divisible good among a group of n agents. Sprumont (1991) showed that if agents have single-peaked preferences over their shares, the uniform rule is the unique strategy-proof, efficient, and anonymous rule. Ching and Serizawa (1998) extended this result by showing that the set of single-plateaued preferences is the largest ...

متن کامل

Maximal Domain of Preferences in the Division Problem

The division problem consists of allocating an amount of a perfectly divisible good among a group of n agents. Sprumont (1991) showed that if agents have single-peaked preferences over their shares, then the uniform allocation rule is the unique strategy-proof, efficient, and anonymous rule. We identify the maximal set of preferences, containing the set of single-peaked preferences, under which...

متن کامل

Impossibilities for probabilistic assignment

We consider the problem of assigning objects probabilistically among a group of agents who may have multi-unit demands. Each agent has linear preferences over the (set of) objects. The most commonly used extension of preferences to compare probabilistic assignments is by means of stochastic dominance, which leads to corresponding notions of envy-freeness, efficiency, and strategy-proofness. We ...

متن کامل

Constrained allocation problems with single-peaked preferences: An axiomatic analysis

We introduce a new class of problems that contains two existing classes: allocation problems with single-peaked preferences and bankruptcy problems. On this class, we analyze the implications of well-known properties such as Pareto optimality, strategy-proofness, resource-monotonicity, no-envy, equal treatment of equals, and two new properties we introduce, hierarchical no-envy and independence...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003